turing machines造句
例句与造句
- universal turing machine
通用杜林机 - 5 ito a, inoue k, takanami i . a note on alternating turing machines using small space . ieice trans
但是，就我们所知，对于具有较小空间复杂性的交替式下推自动机的研究还很少。 - the production line include zc auto washer, gd balanced pressure filer, wfg cap turing machine, ssj carrying machine etc
本生产流水线有zc型自动冲瓶机、gd型等压灌装机、wfg型旋盖机及ssj型输送机等系列产品组成。 - 13 yoshinaga t, xu j, inoue k . a note on closure property of sublogarithmic space-bounded 1-inkdot alternating turing machines with only existential universal states
例如，关系在关系代数运算下的结果仍为关系，我们称关系集合在关系代数运算下封闭。 - existing complexity proofs on the circularity problem of ags are based on automata theory, such as writing pushdown acceptor and alternating turing machines
目前对属性文法循环性问题复杂度的证明，多基于自动机理论，如写入推出接受器、交替涂林机等。 - It's difficult to find turing machines in a sentence. 用turing machines造句挺难的
- lecture notes in computer science 843 . berlin : springer-verlag, 1994, pp . 89-94.8 inoue k, ito a, takanami i . on 1-inkdot alternating turing machines with small space
为了严格地分开确定性语言族和非确定性语言族，ranjan等提出了一个稍加修改的图灵机模型，称为1墨水点1inkdot图灵机。 - and yet from a computational standpoint, our automaton still seemed like a self-propelled scooter compared with the rolls-royce of computers on which we had set our sights : the biomolecular turing machine
然而从计算的观点来看，我们的自动机就像人力推进的滑板车一样，而我们的目标，是建造劳斯莱斯级的生物分子涂林机器。 - these languages are not necessarily turing-complete if it has a computational power equivalent to a universal turing machine-in other words, the system and the universal turing machine can emulate each other
这些语言不必是图灵完全的（如果它具有与通用图灵机等同的计算能力换句话说，系统和通用图灵机可以相互模拟）。 - these languages are not necessarily turing-complete if it has a computational power equivalent to a universal turing machine-in other words, the system and the universal turing machine can emulate each other
这些语言不必是图灵完全的（如果它具有与通用图灵机等同的计算能力换句话说，系统和通用图灵机可以相互模拟）。 - in essence, the computational operations of such a turing machine would translate into biomolecular terms as one “ recognition, ” two “ cleavages, ” two “ ligations, ” and a move to the left or right
如果将涂林计算器运作的语言套用在生物分子上的话，将会是一个辨识步骤、两个切割步骤、两个接合步骤，然后向左或向右移动一格。 - the general idea that the environment could affect the relative concentrations of competing transition molecules ? and thus affect the computation ? had already been suggested in the blueprint for the molecular turing machine
在设计分子涂林机器的蓝图时，已经有人提出，环境可能会影响竞争状态下过渡分子的相对浓度（也因此影响计算结果）。 - the reached conclusion shows that no matter how advanced the programming language is, if the real computer is based on the model of " turing machine ", the ability of the program will always be limited, i . e . there are many undecidable programs
由得出的结论可知：无论程序设计语言如何进步，只要最终的实际计算机是基于图灵机模型，则程序的功能总具有局限性，即存在大量不可判定的程序。 - the time petri nets which are discussed in this thesis are very simple and have the same modeling power as the turing machine, however, in general, there is just no comparison between the liveness, boundedness behaviors of a given time petri net and those of its corresponding classical petri net without time restrictions
本文研究的timepetrinet(简称为tpn)简单且模拟能力等价于图灵机，但tpn的活性、有界性和对应的传统petri网的相应性质并无对应关系。 - in the third section, the author discusses different functionalism types, including david lewis's commonsense functionalism, machine functionalism, homuncular functionalism and teleological functionalism . the author analyses two concepts, ramsey sentence and turing machine, which are important for functionalism, and explains the view of functionalism by using both concepts . in the fourth section, the author displays many difficulties functionalism faces
在第三部分，笔者论述了功能主义的分类，把其分为刘易斯的常识功能主义、机器功能主义、小人功能主义和目的论功能主义，重点说明了对功能主义影响深远的两个概念：拉姆齐语句和图灵机，通过这两个概念细致地说明了功能主义对心身问题的看法。